Dense H-Free Graphs are Almost (χ(H)-1)-Partite
نویسنده
چکیده
By using the Szemerédi Regularity Lemma [10], Alon and Sudakov [1] recently extended the classical Andrásfai-Erdős-Sós theorem [2] to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true. Given any (r+1)-partite graph H whose smallest part has t vertices, there exists a constant C such that for any given ε > 0 and sufficiently large n the following is true. Whenever G is an n-vertex graph with minimum degree
منابع مشابه
Stability results for graphs with a critical edge
The classical stability theorem of Erdős and Simonovits states that, for any fixed graph with χ(H) = k+ 1 ≥ 3, the following holds: every n-vertex graph that is H-free and has within o(n2) of the maximal possible number of edges can be made into the k-partite Turán graph by adding and deleting o(n2) edges. In this paper, we prove sharper quantitative results for graphs H with a critical edge, b...
متن کاملMany cliques in H-free subgraphs of random graphs
For two fixed graphs T and H let ex(G(n, p), T,H) be the random variable counting the maximum number of copies of T in an H-free subgraph of the random graph G(n, p). We show that for the case T = Km and χ(H) > m the behavior of ex(G(n, p),Km, H) depends strongly on the relation between p and m2(H) = maxH′⊆H,|V (H′)|′≥3 { e(H′)−1 v(H′)−2 } . When m2(H) > m2(Km) we prove that with high probabili...
متن کاملMany T copies in H-free subgraphs of random graphs
For two fixed graphs T and H let ex(G(n, p), T,H) be the random variable counting the maximum number of copies of T in an H-free subgraph of the random graph G(n, p). We show that for the case T = Km and χ(H) > m the behavior of ex(G(n, p),Km, H) depends strongly on the relation between p and m2(H) = maxH′⊂H,|V (H′)|′≥3 { e(H′)−1 v(H′)−2 } . When m2(H) > m2(Km) we prove that with high probabili...
متن کاملTHE TYPICAL STRUCTURE OF SPARSE Kr+1-FREE GRAPHS
Two central topics of study in combinatorics are the so-called evolution of random graphs, introduced by the seminal work of Erdős and Rényi, and the family of H-free graphs, that is, graphs which do not contain a subgraph isomorphic to a given (usually small) graph H. A widely studied problem that lies at the interface of these two areas is that of determining how the structure of a typical H-...
متن کامل2 3 Ju l 2 01 3 THE TYPICAL STRUCTURE OF SPARSE K r + 1 - FREE GRAPHS
Abstract. Two central topics of study in combinatorics are the so-called evolution of random graphs, introduced by the seminal work of Erdős and Rényi, and the family of H-free graphs, that is, graphs which do not contain a subgraph isomorphic to a given (usually small) graph H . A widely studied problem that lies at the interface of these two areas is that of determining how the structure of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010